Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata

نویسنده

Vojtech Vorel

چکیده

A word is called a reset word for a deterministic finite automaton if it maps all the states of the automaton to a unique state. Deciding about the existence of a reset word of a given maximum length for a given automaton is known to be an NP-complete problem. We prove that it remains NP-complete even if restricted to Eulerian automata with binary alphabets, as it has been conjectured by Martyugin (2011).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Novel D-Flip Flops with Level Triggered Reset in Quantum Dot Cellular Automata Technology

Quantum dot cellular automata (QCA) introduces a pioneer technology in nano scale computer architectures. Employing this technology is one of the solutions to decrease the size of circuits and reducing power dissipation. In this paper, two new optimized FlipFlops with reset input are proposed in quantum dot cellular automata technology. In addition, comparison with related works is performed.Th...

متن کامل

An Extremal Series of Eulerian Synchronizing Automata

We present an infinite series of n-state Eulerian automata whose reset words have length at least (n − 3)/2. This improves the current lower bound on the length of shortest reset words in Eulerian automata. We conjecture that (n − 3)/2 also forms an upper bound for this class and we experimentally verify it for small automata by an exhaustive computation.

متن کامل

Synchronizing Automata on Quasi-Eulerian Digraph

In 1964 Černý conjectured that each n-state synchronizing automaton posesses a reset word of length at most (n − 1). From the other side the best known upper bound on the reset length (minimum length of reset words) is cubic in n. Thus the main problem here is to prove quadratic (in n) upper bounds. Since 1964, this problem has been solved for few special classes of synchronizing automata. One ...

متن کامل

Subset Synchronization and Careful Synchronization of Binary Finite Automata

We consider the following generalized notion of synchronization: A word is called a reset word of a subset of states of a deterministic finite automaton if it maps all states of the set to a unique state. It is known that the minimum length of such words is superpolynomial in worst cases, namely in a series of substantially nontransitive automata. We present a series of transitive binary automa...

متن کامل